Generalization of an Identity of Andrews

نویسنده

  • Eduardo H. M. Brietzke
چکیده

Abstract We consider an identity relating Fibonacci numbers to Pascal’s triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, all of them rather involved or else relying on sophisticated number theoretical arguments. We not only give a simple and elementary proof, but also show the identity generalizes to arrays other than Pascal’s triangle. As an application we obtain identities relating trinomial coefficients and Catalan’s triangle to Fibonacci numbers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variants of the Andrews-gordon Identities

The object of this paper is to propose and prove a new generalization of the Andrews-Gordon Identities, extending a recent result of Garrett, Ismail and Stanton. We also give a combinatorial discussion of the finite form of their result which appeared in the work of Andrews, Knopfmacher, and Paule.

متن کامل

Andrews and Buggey’s Authenticity Theory and Public Library's Role in Preserving and Safeguarding Iran's Aboriginal Cultural Landscapes

Purpose: Authenticity in cultural landscapes integrates our identity with land, aboriginals, symbols, values and also aboriginals’ believe system. Public libraries are assumed to play an important role in preserving this authenticity. The purpose of this study was to test this presumption on the bases of viewpoints of central and local managers at Iran Public Libraries Organization. Method: Th...

متن کامل

Variants of the Andrews - Gordon

The object of this paper is to propose and prove a new generalization of the Andrews-Gordon Identities, extending a recent result of Garrett, Ismail and Stanton. We also give a combinatorial discussion of the finite form of their result which appeared in the work of Andrews, Knopfmacher, and Paule.

متن کامل

A Bijective Proof of a Limiting Case of Watson’s 8φ7 Transformation Formula

Andrews gave a combinatorial proof of the Rogers-Fine identity. In this paper, we present a combinatorial proof of a special case of Watson’s 8φ7 transformation formula, which is a generalization of Andrews’ proof.

متن کامل

Overpartition Theorems of the Rogers-ramanujan Type

We give one-parameter overpartition-theoretic analogues of two classical families of partition identities: Andrews’ combinatorial generalization of the Gollnitz-Gordon identities and a theorem of Andrews and Santos on partitions with attached odd parts. We also discuss geometric counterparts arising from multiple q-series identities. These involve representations of overpartitions in terms of g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004